Iterative beam search algorithms for the permutation flowshop

Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by hybridization with local search. The main positive effect of the hybridization is the improvement in the convergence speed to the Pareto front. On the other hand, the main negative effect is the increase in the computation time per generation. Thus, the number of generations is d...

Permutation Flowshop Scheduling by Genetic Local Search

In this paper, the landscape for the permutation flowshop scheduling problem (PFSP) with stochastic local search and a critical block-based neighbourhood structure has been investigated. Numerical experiments using small benchmark problems show that there are good correlations between the makespans of local optima, the average distances to other local optima and the distances to the known globa...

Effective Stochastic Local Search Algorithms For Bi-Objective Permutation Flowshop Scheduling

In this report, we study stochastic local search (SLS) algorithms for biobjective optimization problems. In particular, we study multi-objective algorithms that belong to two different classes of approaches, those that use a scalarized acceptance criterion (SAC) and those that use a componentwise acceptance criterion (CWAC). As a representative example of a SAC algorithm, we study Two-Phase Loc...

Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling

This paper presents the steps followed in the design of hybrid stochastic local search algorithms for biobjective permutation flow shop scheduling problems. In particular, this paper tackles the three pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) the weighted total tardiness of all jobs. The proposed algorithms are combinations...

Fast search algorithms for layout permutation problems